Self-similar Discrete Rotation Configurations and Interlaced Sturmian Words
نویسنده
چکیده
Rotation configurations for quadratic angles exhibit self-similar dynamics. Visually, it may be considered as quite evident. However, no additional details have yet been published on the exact nature of the arithmetical reasons that support this fact. In this paper, to support the existence of self-similar dynamic in 2d-configuration, we will use the constructive 1-d substitution theory in order to iteratively build quadratic rotation configurations from substitutive Sturmian words. More specifically : the self-similar rotation configurations are first shown to be an interlacing of configurations that are direct product of superposition of Sturmian words.
منابع مشابه
Language structure of pattern Sturmian words
Pattern Sturmian words introduced by Kamae and Zamboni KZ KZ are an analogy of Sturmian words for the maximal pattern com plexity instead of the block complexity So far two kinds of recur rent pattern Sturmian words are known namely rotation words and Toeplitz words But neither a structural characterization nor a reason able classi cation of the recurrent pattern Sturmian words is known In this...
متن کاملMaximal pattern complexity for discrete systems
For an infinite word α = α0α1α2 · · · over a finite alphabet, Kamae introduced a new notion of complexity called maximal pattern complexity defined by pα(k) := sup τ ]{αn+τ(0)αn+τ(1) · · ·αn+τ(k−1); n = 0, 1, 2, · · · } where the supremum is taken over all sequences of integers 0 = τ(0) < τ(1) < · · · < τ(k − 1) of length k. Kamae proved that α is aperiodic if and only if pα(k) ≥ 2k for every k...
متن کاملRandom generation of finite Sturmian words
We present a bijection between the set of factors of given length of Sturmian words and some set of triples of nonnegative integers. This bijection and its inverse are both computable in linear time. Its applications are: a bijective proof of Mignosi's formula for counting Sturmian words, a linear probabilistic algorithm for generating finite Sturmian word at random, and, using similar techniqu...
متن کاملHierarchical structures in Sturmian dynamical systems
We study hierarchical properties of Sturmian words. These properties are similar to those of substitution dynamical systems. This approach allows one to carry over to Sturmian dynamical systems methods developed in the context of substitutions. For example, it allows for a proof of an ergodic type theorem for additive functions taking values in a Banach space. We then focus on establishing vari...
متن کاملSturmian Canons
Sturmian words are balanced, almost periodic, self-similar and hierarchical infinite sequences that have been studied in music theory in connection with diatonic scale theory and related subjects.[3][5] Carey and Camplitt 1996 give a brief but suggestive rhythmic example in which these properties are made manifest in a particularly visceral manner. The present paper expands upon this example, c...
متن کامل